A QTM-based Algorithm for Generation of the Voronoi Diagram on a Sphere
نویسندگان
چکیده
To efficiently store and analyse spatial data at a global scale, the digital expression of the Earth’s data must be global, continuous and conjugate, i.e., a spherical dynamic data model is needed. The Voronoi data structure is the only published attempt and only solution (which is currently available) for dynamic GIS. The complexity of the Voronoi algorithms for line and area data sets in a vector-based context limits its application in dynamic GISs. As yet, there is no raster-based Voronoi algorithm for objects (including points, arcs and regions). To overcome this deficiency, an algorithm for generating a spherical Voronoi diagram, that is a Voronoi diagram on a spherical surface, is presented based on O-QTM (Octahedral Quaternary Triangular Mesh). The basic idea is to apply the dilation operation developed in mathematical morphology to objects on the sphere in an effort to produce the effect of distance transformation. The distance contours of objects will form the Voronoi boundaries of the spherical objects. The algorithm presented in this paper can handle point, line and area objects. Additionally, it has been tested and concluded that the processing time required for this algorithm with point, arc and region data is proportional to the levels of complexity of the spherical surface tessellation. The difference (error) between the great circle distance and the QTM cells distance is related to the spherical distance.
منابع مشابه
A Mix Global Data Structure Based on Qtm and Voronoi
To efficiently store, retrieve and update the global spatial data, a hierarchical and dynamic data model on a global scale is urgently needed. The QTM (Quaternary Triangular Mesh) as a hierarchical quadtree data structure on sphere is one of the most efficient methods for managing the global spatial data in many applications. But QTM structure is based on fields instead of objects. So it is eff...
متن کاملVoronoi Diagrams on the Sphere
Given a set of compact sites on a sphere, we show that their spherical Voronoi diagram can be computed by computing two planar Voronoi diagrams of suitably transformed sites in the plane. We also show that a planar furthest-site Voronoi diagram can always be obtained as a portion of a nearest-site Voronoi diagram of a set of transformed sites. Two immediate applications are an O(n logn) algorit...
متن کاملVoronoi diagrams on the spher
Given a set of compact sites on a sphere, we show that their spherical Voronoi diagram can be computed by computing two planar Voronoi diagrams of suitably transformed sites in the plane. We also show that a planar furthest-site Voronoi diagram can always be obtained as a portion of a nearest-site Voronoi diagram of a set of transformed sites. Two immediate applications are an O(n logn) algorit...
متن کاملA Plane Sweep Algorithm for the Voronoi Tessellation of the Sphere
We have extended Fortune’s sweep-line algorithm for the construction Voronoi diagrams in the plane to the surface of a sphere. Although the extension is straightforward, it requires interesting modifications. The main difference between the sweep line algorithms on plane and on the sphere is that that the beach line on the sphere is a closed curve. We have implemented this algorithm and tessell...
متن کاملMobile Robot Online Motion Planning Using Generalized Voronoi Graphs
In this paper, a new online robot motion planner is developed for systematically exploring unknown environ¬ments by intelligent mobile robots in real-time applications. The algorithm takes advantage of sensory data to find an obstacle-free start-to-goal path. It does so by online calculation of the Generalized Voronoi Graph (GVG) of the free space, and utilizing a combination of depth-first an...
متن کامل